- BSP tree
- двоичное дерево распределения пространства
Англо-русский словарь компьютерных и интернет терминов. 2013.
BSP tree
Смотреть что такое "BSP tree" в других словарях:
BSP Tree — Der Begriff Binary Space Partitioning (BSP, „binäre Raumpartitionierung“) bezeichnet eine Technik zur Partitionierung multidimensionaler Daten durch eine Menge von Hyperebenen. Die so erstellte Datenstruktur ist ein Binärbaum und wird BSP Baum… … Deutsch Wikipedia
BSP (file format) — BSP is a map file extension used in games such as the Doom , Quake , and games that use Quake derived engines, such as the Half Life series. .BSP files use binary space partitioning to generate levels that can be rendered quickly while minimizing … Wikipedia
.bsp — Partition binaire de l espace Pour les articles homonymes, voir BSP. La partition binaire de l espace (binary space partitioning ou BSP) est un système utilisé par un moteur de jeu pour calculer des espaces pleins (bloquant) et vides (ou le… … Wikipédia en Français
BSP-Baum — Der Begriff Binary Space Partitioning (BSP, „binäre Raumpartitionierung“) bezeichnet eine Technik zur Partitionierung multidimensionaler Daten durch eine Menge von Hyperebenen. Die so erstellte Datenstruktur ist ein Binärbaum und wird BSP Baum… … Deutsch Wikipedia
Tree (data structure) — A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent. In computer science, a tree is a widely used data structure that emulates a… … Wikipedia
BSP — abbr. BetriebsSystemProzessor (Windows, NT, SMP) abbr. Binary Space Partioning (tree) abbr. Bug Squashing Party (Linux, Debian) comp. abbr. Bulk Synchronous Parallelism … United dictionary of abbreviations and acronyms
VP-tree — A vantage point tree, or vp tree is a BSP tree that segregates data in a metric space by choosing a position in the space (the vantage point ) and dividing the data points into two partitions: those that are nearer to the vantage point than a… … Wikipedia
Kd-tree — In computer science, a k d tree (short for k dimensional tree ) is a space partitioning data structure for organizing points in a k dimensional space. k d trees are a useful data structure for several applications, such as searches involving a… … Wikipedia
Binary tree — Not to be confused with B tree. A simple binary tree of size 9 and height 3, with a root node whose value is 2. The above tree is unbalanced and not sorted. In computer science, a binary tree is a tree data structure in which each node has at… … Wikipedia
Hash tree — A binary hash tree In cryptography and computer science Hash trees or Merkle trees are a type of data structure[citation needed] which contains a tree of summary information about a larger piece of da … Wikipedia
Radix tree — In computer science, a radix tree (also patricia trie or radix trie) is a space optimized trie data structure where each node with only one child is merged with its child. The result is that every internal node has at least two children. Unlike… … Wikipedia
